Search results
40 packages found
Trie, Prefix tree. Javascript & Typescript Data Structure.
- Trie
- prefix tree
- prefixtree
- Prefix tree
- prefix-tree
- prefix
- digital tree
- digitaltree
- Digital Tree
- digital-tree
- digital
- radix tree
- radixtree
- Radix Tree
- View more
Minimal trie datastructure representation
- trie
- trie-d
- auto complete
- near match
- search
- hashmatch
- node-trie
- trie-search
- keywords-search
- dynamic trie
- word search
- word
- autocomplete
- autosearch
- View more
radix-trie implementation for Inverse Index Document Search.
radix-trie implementation for Inverse Index Document Search.
Simple, modifiable item-title search index based on radix tries.
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
Trie based search for autocompletes with Redis.
Trie based search for autocompletes with Redis. (support vietnamese)
A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044
autocomplete-trie-search is an NPM package that provides fast and efficient autocomplete suggestions for text input fields using the trie data structure. With autocomplete-trie-search, you can easily integrate autocomplete functionality into your web or m
Customizable trie data structure built in JavaScript.
Simple redis-backed library for managing and querying an autocomplete dictionary.
Minimalistic trie implementation for autosuggest and autocomplete components.
- autosuggest
- autocomplete
- auto suggest
- auto complete
- trie autosuggest
- trie autocomplete
- trie auto suggest
- trie auto complete
- autosuggest trie
- autocomplete trie
- auto suggest trie
- auto complete trie
My take on an efficient implementation of a Trie in Javascript
Customizable trie data structure built in JavaScript.
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
Customizable trie data structure built in JavaScript.
The extremely fast compressed trie implementation.
A utility for autocompleting words using in memory trie data structure